An Alternative Method to Gauss-Jordan Elimination: Minimizing Fraction Arithmetic
نویسندگان
چکیده
When solving systems of equations by using matrices, many teachers present a Gauss-Jordan elimination approach to row reducing matrices that can involve painfully tedious operations with fractions (which I will call the traditional method). In this essay, I present an alternative method to row reduce matrices that does not introduce additional fractions until the very last steps. The students in my classes seemed to appreciate the efficiency and accuracy that the alternative method offered. Freed from unnecessary computational demands, students were instead able to spend more time focusing on designing an appropriate system of equations for a given problem and interpreting the results of their calculations. I found that these students made relatively few arithmetic mistakes as compared to students I tutored in the traditional method, and many of these students who saw both approaches preferred the alternative method.
منابع مشابه
Stability of Gauss-Huard Elimination for Solving Linear Systems
This paper considers elimination methods to solve dense linear systems, in particular a variant due to Huard of Gaussian elimination [13]. This variant reduces the system to an equivalent diagonal system just as GaussJordan elimination, but does not require more floating-point operations than Gaussian elimination. Huard's method may be advantageous for use in computers with hierarchical memory,...
متن کاملAn Explicit Construction of Gauss-Jordan Elimination Matrix
A constructive approach to get the reduced row echelon form of a given matrix A is presented. It has been shown that after the kth step of the Gauss-Jordan procedure, each entry akij(i 6= j, j > k) in the new matrix A can always be expressed as a ratio of two determinants whose entries are from the original matrix A. The new method also gives a more general generalization of Cramer’s rule than ...
متن کاملGauss-jordan Elimination: a Method to Solve Linear Systems
(1) A system of linear equations can be stored using an augmented matrix. The part of the matrix that does not involve the constant terms is termed the coefficient matrix. (2) Variables correspond to columns and equations correspond to rows in the coefficient matrix. The augmented matrix has an extra column corresponding to the constant terms. (3) In the paradigm where the system of linear equa...
متن کاملSpeed Enhancement on a Matrix Inversion Hardware Architecture Based on Gauss-jordan Elimination Oh Eng Wei Universiti Teknologi Malaysia Speed Enhancement on a Matrix Inversion Hardware Architecture Based on Gauss-jordan Elimination Oh Eng Wei
Matrix inversion is a mathematical algorithm that is widely used and applied in many real time engineering applications. It is one of the most computational intensive and time consuming operations especially when it is performed in software. Gauss-Jordan Elimination is one of the many matrix inversion algorithms which has the advantage of using simpler mathematical operations to get the result....
متن کاملGauss-Jordan Elimination for Matrices Represented as Functions
This theory provides a compact formulation of Gauss-Jordan elimination for matrices represented as functions. Its distinctive feature is succinctness. It is not meant for large computations. 1 Gauss-Jordan elimination algorithm theory Gauss-Jordan-Elim-Fun imports Main begin Matrices are functions: type-synonym ′a matrix = nat ⇒ nat ⇒ ′a In order to restrict to finite matrices, a matrix is usua...
متن کامل